Wire length as a circuit complexity measure

Wire length as a circuit complexity measure

We introduce wire length as a salient complexity measure for analyzing the circuit complexity of sensory processing in biological neural systems. This new complexity measure is applied in this paper to two basic computational problems that arise in translationand scale-invariant pattern recognition, and hence appear to be useful as benchmark problems for sensory processing. We present new circu...

Estimating Shortest Circuit Path Length Complexity

When binary decision diagrams are formed from uniformly distributed Monte Carlo data for a large number of variables, the complexity of the decision diagrams exhibits a predictable relationship to the number of variables and minterms. In the present work, a neural network model has been used to analyze the pattern of shortest path length for larger number of Monte Carlo data points. The neural ...

Sensing as a Complexity Measure

RMC – a Length-independent Measure of Software Complexity

A Resource Model of software Complexity (RMC) based on measurement theory is introduced. It is argued that a complexity measure conforming with our empirical understanding of complexity should be independent of software length. The measure is defined by w(p) = l(p)c(p), where p is any piece of software, w(p) the resouces needed in developing it, l(p) its length, and c(p) its complexity. Rules f...

Information Measure as Time Complexity

The concept of Shannon entropy of random variables was generalized to measurable functions in general, and to simple functions with finite values in particular. It is shown that the information measure of a function is related to the time complexity of search problems concerning the function in question. Formally, given a Turing reduction from a search problem y x f  ) ( to another search prob...